class Solution1 {
    public int minimumDeleteSum(String s1, String s2) {
        int n = s1.length(), m = s2.length();
        int[][] dp = new int[n+1][m+1];
        int sum = 0;
        for(char ch: s1.toCharArray()) {
            sum += ch;
        }
        for(char ch: s2.toCharArray()) {
            sum += ch;
        }
        for(int i = 1; i<= n; i++) {
            for(int j = 1; j<=m; j++) {
                if(s1.charAt(i-1) == s2.charAt(j-1)) {
                    dp[i][j] = dp[i-1][j-1] + s1.charAt(i-1);
                }else {
                    dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }

        int ret = sum - 2*dp[n][m];
        return ret;
    }
}


class Solution {
    public int findLength(int[] nums1, int[] nums2) {
        int n = nums1.length, m = nums2.length;
        int[][] dp = new int[n+1][m+1];
        int ret = 0;
        for(int i = 1; i<=n; i++) {
            for(int j = 1; j<=m; j++) {
                if(nums1[i-1] == nums2[j-1]) {
                    dp[i][j] = dp[i-1][j-1] + 1;
                }else {
                    dp[i][j] = 0;
                }
                ret = Math.max(ret,dp[i][j]);
            }
        }
        return ret;
    }
}

public class Test {

}
